Exact diagonalization of the Hubbard model on graphics processing units
نویسندگان
چکیده
منابع مشابه
Exact diagonalization: the Bose–Hubbard model as an example
We take the Bose–Hubbard model to illustrate exact diagonalization techniques in a pedagogical way. We follow the route of first generating all the basis vectors, then setting up the Hamiltonian matrix with respect to this basis and finally using the Lanczos algorithm to solve low lying eigenstates and eigenvalues. Emphasis is placed on how to enumerate all the basis vectors and how to use the ...
متن کاملCofactorization on Graphics Processing Units
We show how the cofactorization step, a compute-intensive part of the relation collection phase of the number field sieve (NFS), can be farmed out to a graphics processing unit. Our implementation on a GTX 580 GPU, which is integrated with a state-of-the-art NFS implementation, can serve as a cryptanalytic co-processor for several Intel i7-3770K quad-core CPUs simultaneously. This allows those ...
متن کاملThe nonequispaced FFT on graphics processing units
Without doubt, the fast Fourier transform (FFT) belongs to the algorithms with large impact on science and engineering. By appropriate approximations, this scheme has been generalized for arbitrary spatial sampling points. This so called nonequispaced FFT is the core of the sequential NFFT3 library and we discuss its computational costs in detail. On the other hand, programmable graphics proces...
متن کاملComparison of Calculations for the Hubbard model obtained with Quantum-Monte-Carlo, exact and stochastic Diagonalization
In this paper we compare numerical results for the ground state of the Hubbard model obtained by Quantum-Monte-Carlo simulations with results from exact and stochastic diagonalizations. We find good agreement for the ground state energy and superconducting correlations for both, the repulsive and attractive Hubbard model. Special emphasis lies on the superconducting correlations in the repulsiv...
متن کاملImplementation of Image Processing Algorithms on the Graphics Processing Units
The paper describes features of the multithreaded algorithms implementation on contemporary CPU and GPU. The features of access of a graphics processing unit (GPU) memory are reviewed. The bottlenecks have been identified, in which there is a loss of speed in image processing. Recommendations are made for optimization of algorithms for processing image of various size. Examples of implementatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2012
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2012.04.006